On incidence algebras description of cobweb posets
نویسنده
چکیده
Abstract The explicite formulas for Möbius function and some other important elements of the incidence algebra of an arbitrary cobweb poset are delivered. For that to do one uses Kwaśniewski’s construction of his cobweb posets [8, 9]. The digraph representation of these cobweb posets constitutes a newly discovered class of orderable DAG’s [12, 6, 1] named here down KoDAGs with a kind of universality now being investigated. Namely cobweb posets’ and thus KoDAGs’s defining di-bicliques are links of any complete relations’ chains.
منابع مشابه
Reduced Incidence algebras description of cobweb posets and KoDAGs
The notion of reduced incidence algebra of an arbitrary cobweb poset is delivered.
متن کاملCobweb posets as noncommutative prefabs
A class of new type graded infinite posets with minimal element is introduced. These so called cobweb posets proposed recently by the present author constitute a wide range of new noncommutative and nonassociative prefab combinatorial schemes‘ examples with characteristic graded sub-posets as primes. These schemes are defined here via relaxing commutativity and associativity requirements impose...
متن کاملReport On Cobweb Posets' Tiling Problem
Responding to Kwaśniewski’s cobweb posets’ problems posed in [3, 4] we present here some results on one of them namely on Cobweb Tiling Problem. Kwaśniewski cobweb posets with tiling property are designated-coded by their correspondent tiling sequences. We show that the family of all cobweb tiling sequences includes Natural numbers, Fibonacci numbers, Gaussian integers and show that there are m...
متن کاملSome Cobweb Posets Digraphs’ Elementary Properties and Questions
A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of di-bigraphs (directed bi-parted graphs) and their corresponding adjacency matrices is defined and then applied t...
متن کاملOn Cobweb Posets and Discrete F-Boxes Tilings
Abstract F -boxes defined in [6] as hyper-boxes in N∞ discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F -boxes edges sizes are taken to be values of terms of natural numbers’ valued sequence F . The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F -ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0802.3703 شماره
صفحات -
تاریخ انتشار 2008